A Broadcast Encryption Scheme with Free-Riders but Unconditional Security
نویسندگان
چکیده
We propose two schemes for efficient broadcast key establishment that enables a sender to communicate to any subset of the user-base by allowing a small ratio of free-riders. The schemes do not require stateful receivers and one scheme is unconditionally secure. The free-riders are unable to learn from the past whether they might become free-riders for a certain transmission again. We present a new trade-off facet for broadcast encryption, namely the number (or ratio) of free-riders vs. the number of messages to be sent or the number of keys stored by each user.
منابع مشابه
Broadcast Encryption with Free-Riders and Unconditional Security
We propose two schemes for efficient broadcast key establishment that enables a sender to communicate to any subset of the user-base by allowing a small ratio of free-riders. The schemes do not require stateful receivers and one scheme is unconditionally secure. The free-riders are unable to learn from the past whether they might become free-riders for a certain transmission again. We present a...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملOptimal subset-difference broadcast encryption with free riders
Broadcast encryption (BE) deals with secure transmission of a message to a group of receivers such that only an authorized subset of receivers can decrypt the message. The transmission cost of a BE system can be reduced considerably if a limited number of free riders can be tolerated in the system. In this paper, we study the problem of how to optimally place a given number of free riders in a ...
متن کاملFast Algorithms for the Free Riders Problem in Broadcast Encryption
We provide algorithms to solve the free riders problem in broadcast encryption. In this problem, the broadcast server is allowed to choose some small subset F of the revoked set R of users to allow to decrypt the broadcast, despite having been revoked. This may allow the server to significantly reduce network traffic while only allowing a small set of non-privileged users to decrypt the broadca...
متن کاملForward-Secure Identity-based Broadcast Encryption Scheme from Lattice
Motivated by an identity-based broadcast encryption scheme from lattice[1] and a forward-secure identity-based encryption scheme[2], we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encryption scheme and forward-security...
متن کامل